Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry
نویسندگان
چکیده
منابع مشابه
Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry
In this paper, we study the problem of implementing standard data structures on a hypercube multiprocessor. We present a technique for efficiently executing multiple independant search processes on a class of graphs called ordered h-level graphs. We show how this technique can be utilized to implement a segment tree on a hypercube, thereby obtainig O(logZn) time algorithms for sotving the next ...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملOrdered Fast Fourier Transforms on a Massively Parallel Hypercube Multiprocessor
We examine design alternatives for ordered FFT algorithms on massively parallel hypercube multiprocessors such as the Connection Machine. Particular emphasis is placed on reducing communication which is known to dominate the overall computing time. To this end we combine the order and computational phases of the FFT and also use sequence to processor maps that reduce communication. The class of...
متن کاملExperiences Implementing a Parallel ATMS on a Shared-Memory Multiprocessor
The Assumption-Based Truth Maintenance System (ATMS) is an important tool in A I . So far its wider use has been l imited due to the enormous computational resources which it requires. We investigate the possibility of speeding it up by using a modest number of processors in parallel. We begin with a highly efficient sequential version written in C and then extend this version to allow parallel...
متن کاملParLeda: A Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP which is based on BSP and is introduced here. ParLeda uses two main libr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1990
ISSN: 0743-7315
DOI: 10.1016/0743-7315(90)90135-c